Task #0402

Memory 16 MB Time 1000 ms Complexity 30 %

Author: Islomjon Isomov

Maksimum EKUB

Sizga \(N\) soni beriladi. Siz EKUB (N ^ M , N & M) ning \(( N > M )\) maksimal qiymatini topishingiz kerak.

N = 8 boʻlganda,

Gcd ( 8 ^ 0 , 8 & 0 ) = 8
Gcd ( 8 ^ 1 , 8 & 1 ) = 9
Gcd ( 8 ^ 2 , 8 & 2 ) = 10
Gcd ( 8 ^ 3 , 8 & 3 ) = 11
Gcd ( 8 ^ 4 , 8 & 4 ) = 12
Gcd ( 8 ^ 5 , 8 & 5 ) = 13
Gcd ( 8 ^ 6 , 8 & 6 ) = 14
Gcd ( 8 ^ 7 , 8 & 7 ) = 15

Maksimum EKUB = 15

Input:

Kirish faylida faqat bitta son \(N ( 2 ≤ N ≤ 10^{9} )\) kiritiladi.

Output:

Chiqish faylida bitta butun son EKUB (N ^ M , N & M) ning maksimum qiymatini chop eting.

Examples

#	input.txt	output.txt
1	8	15

Submit answer

Please, sing in, to complete this action, if you don't have account, you can sign up any moment